Expressive Completeness of Temporal Logic of Action
نویسنده
چکیده
The paper compares the expressive power of monadic second order logic of order, a fundamental formalism in mathematical logic and theory of computation, with that of a fragment of Temporal Logic of Actions introduced by Lamport for specifying the behavior of concurrent systems.
منابع مشابه
Distributed Contingency Logic and Security
In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...
متن کاملExpressive completeness of temporal logic of trees
Many temporal and modal logic languages can be regarded as subsets of rst order logic i e the semantics of a temporal logic formula is given as a rst order condition on points of the underlying models Kripke structures Often the set of possible models is restricted to models which are trees A temporal logic language is rst order expressively complete if for every rst order condition for a node ...
متن کاملA Temporal Relational Algebra as Basis for Temporal Relational Completeness
We define a tenlporal algebra that is applicable to any temporal relational data model supporting discrete linear bounded time. This algebra has the five basic relational algebra operators extended to the temporal domain and an operator of linear recursion. We show that this algebra has the expressive power of a safe temporal calculus based on the predicate temporal logic with the until and sin...
متن کاملOn the Expressiveness and Monitoring of Metric Temporal Logic
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded sig...
متن کاملComplete axiomatization of the stutter-invariant fragment of the linear time μ-calculus
The logic μ(U) is the fixpoint extension of the “Until”-only fragment of linear-time temporal logic. It also happens to be the stutter-invariant fragment of linear-time μ-calculus μ(♦). We provide complete axiomatizations of μ(U) on the class of finite words and on the class of ω-words. We introduce for this end another logic, which we call μ(♦Γ), and which is a variation of μ(♦) where the Next...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998